Efficiently Processing Skyline Query on Multi-Instance Data

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-Dimensional Skyline Query Processing

Introduction In many applications, a huge number of geometric, geographic or spatial objects are need to be stored, managed, and retrieved. As examples, some of the traditional applications are listed as follows: • Geographic Information Systems (GIS), which help users to organize their work in many areas, including military applications, environmental information systems, urban planning and so...

متن کامل

Skyline query processing

This thesis deals with a special subset of multi-dimensional set of points, called the Skyline. These points are the maxima or minima of the complete set and are of special interest for the field of decision support. Coming from basic algorithms for computing the Skyline we will develop ideas and algorithms for “on-the-fly” or online computation of the Skyline. We will also extend the concept o...

متن کامل

Efficient Parallel Skyline Query Processing for High-Dimensional Data

Given a set of multidimensional data points, skyline queries retrieve those points that are not dominated by any other points in the set. Due to the ubiquitous use of skyline queries, such as in preference-based query answering and decision making, and the large amount of data that these queries have to deal with, enabling their scalable processing is of critical importance. However, there are ...

متن کامل

A Survey of Skyline Query Processing

Living in the Information Age allows almost everyone have access to a large amount of information and options to choose from in order to fulfill their needs. In many cases, the amount of information available and the rate of change may hide the optimal and truly desired solution. This reveals the need of a mechanism that will highlight the best options to choose among every possible scenario. B...

متن کامل

Efficiently Processing of Top-k Typicality Query for Structured Data

This work presents a novel ranking scheme for structured data. We show how to apply the notion of typicality analysis from cognitive science and how to use this notion to formulate the problem of ranking data with categorical attributes. First, we formalize the typicality query model for relational databases. We adopt Pearson correlation coefficient to quantify the extent of the typicality of a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Information Processing Systems

سال: 2017

ISSN: 2092-805X

DOI: 10.3745/jips.04.0049